منابع مشابه
Homing vector automata
We introduce homing vector automata, which are finite automata augmented by a vector that is multiplied at each step by a matrix determined by the current transition, and have to return the vector to its original setting in order to accept the input. The computational power of the deterministic, nondeterministic and blind versions of these realtime machines are examined and compared to various ...
متن کاملInference of Finite Automata Using Homing Sequences
We present new algorithms for inferring an unknown finite-state automaton from its input/output behavior in the absence of a means of r e ~ r t t i n p the machine to a start d a t e . A key technique used is inference of a homing sequence for the unknown automaton. Our infknrnce procedufes experiment with the unknown machine, and from time t o time require a teacher to supply counterexamplea t...
متن کاملVector team automata
Vector team automata are team automata with an explicit representation of synchronizations. This makes a translation possible of a subclass of vector team automata into individual token net controllers, a model of labeled Petri nets developed within the framework of vector controlled concurrent systems. © 2011 Elsevier B.V. All rights reserved.
متن کاملImplicit Real Vector Automata
This thesis introduces a new data structure, the Implicit Real Vector Automaton (IRVA), suited for representing symbolically polyhedra, i.e., regions of n-dimensional space defined by finite Boolean combinations of linear inequalities. IRVA can represent exactly arbitrary convex and non-convex polyhedra, including features such as open and closed boundaries, unconnected parts, and non-manifold ...
متن کاملReal-Time Vector Automata
We study the computational power of real-time finite automata that have been augmented with a vector of dimension k, and programmed to multiply this vector at each step by an appropriately selected k × k matrix. Only one entry of the vector can be tested for equality to 1 at any time. Classes of languages recognized by deterministic, nondeterministic, and “blind” versions of these machines are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2016
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2016017